On the Huffman and Alphabetic Tree Problem with General Cost Functions
نویسندگان
چکیده
منابع مشابه
Finite Tree Automata with Cost Functions
Cost functions for tree automata are mappings from transitions to (tuples o0 polynomials over some semiring. We consider four semirings, namely N the semiring of nonnegative integers, A the "arctical semiring", T the tropical semiring and F the semiring of finite subsets of nonnegative integers. We show: for semirings N and A it is decidable in polynomial time whether or not the costs of accept...
متن کاملOnline scheduling with general cost functions
We consider a general online scheduling problem on a single machine with the objective of minimizing ∑ j wjg(Fj), where wj is the weight/importance of job Jj , Fj is the flow time of the job in the schedule, and g is an arbitrary non-decreasing cost function. Numerous natural scheduling objectives are special cases of this general objective. We show that the scheduling algorithm Highest Density...
متن کاملazerbaijans political development after the collapse of soviet union and implication on relation with the islamic republic of iran
در فصل اول این پایاین نامه در خصوص تاریخ کشور اذربایجان قبل و بعد از جدایی این کشور از ایران مورد بررسی قرار گرفته است ودر فصل دوم تحولات سیاسی این کشور بعد از 1991 و در واقع بعد از فروپاشی شوروی و دولتهایی که روی کار امدند در از جمله دولت ابولفضل ایلچی بیگ،دولت حیدر علی اف وبعد از او پسرش الهام علی اف و نگرش هرکدام از این دولتها به سیاسیت خارجی اذربایجان مورد اشاره قرار گرفته است.در ودر فصل سو...
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملThe Iterative Minimum Cost Spanning Tree Problem
The minimum cost spanning tree problem consists in constructing a network of minimum cost that connects all agents to the source and distributes the cost among the agents in a fair way. We develop a framework for the iterative minimum cost spanning tree problem. In the iterative setting, agents arrive over time and desire to be connected to a source in different rounds in order to receive a ser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9755-6